搜索资源列表
DiffieHellmanExample_demo
- DH算法是W.Diffie和M.Hellman提出的。此算法是最早的公钥算法。它实质是一个通信双方进行密钥协定的协议：两个实体中的任何一个使用自己的私钥和另一实体的公钥，得到一个对称密钥，这一对称密钥其它实体都计算不出来。
haraksingh
- The Diffie Hellman Key Exchange Protocol and its relationship to the Elliptic Curve Discrete Logarithm Problem
Secure-Chat-Room
- 本聊天室基于Diffie-Hellman密钥协商协议，并用数字签名实现身份认证，以实现一个安全频道的搭建。-The chat room based on Diffie-Hellman key agreement and authentication using digital signatures to achieve in order to achieve a secure channel structures.
DiffieHellman
- 理解 Diffie-Hellman 密钥交换协议的基本思想。了解Diffie-Hellman 密钥交换协议的基本步骤。模拟实现简单的Diffie-Hellman 密钥交换协议过程。 -Understanding Diffie-Hellman key exchange protocol the basic idea. Learn Diffie-Hellman key exchange protocols basic steps. Simulation to achieve a simple
svr-kex
- Handle a diffie-hellman key exchange initialisation.
DHPrivateKeySpec
- The key specification for a Diffie- Hellman private key.
DHParameterSpec
- The algorithm parameter specification for the Diffie-Hellman algorithm.
DHBasicKeyPairGenerator
- This generates keys consistent for use with the basic algorithm for Diffie-Hellman.
DHPrivateKey
- The interface for a private key in the Diffie-Hellman key exchange protocol.
DHPublicKey
- The interface for a public key in the Diffie-Hellman key exchange protocol.
DiffieHellmanExample1_src
- diffie-hellman算法，MFC实现-diffie-hellman algorithm
DH
- Diffie-Hellman:一种确保共享KEY安全穿越不安全网络的方法，它是OAKLEY的一个组成部分。Whitefield与Martin Hellman在1976年提出了一个奇妙的密钥交换协议，称为Diffie-Hellman密钥交换协议/算法(Diffie-Hellman Key Exchange/Agreement Algorithm).这个机制的巧妙在于需要安全通信的双方可以用这个方法确定对称密钥。然后可以用这个密钥进行加密和解密。但是注意，这个密钥交换协议/算法只能用于密钥的交换，而
JCEDHKeyAgreement
- Diffie-Hellman key agreement.
Test_istore_0
- The interface for a Diffie-Hellman key.
Diffie_HEllman_Client_SERVER
- Diffie hellman key exchange source code in C language for client server application
Diff_doc
- This Document gives the Steps for Diffie Hellman Program
C9875432269
- Review of Diffie–Hellman key Exchange
dh
- Diffie Hellman Key Exchange
AliceAndBob
- Demo Classic Diffie-Hellman
diffie_hellman
- Implement Diffie-Hellman Key exchange protocol and demonstrate that at the end, both person will have a common Key. Do the following: 1. Set a variable p ( e.g. p = 37) and g (e.g. g = 5). 2. Generate a, a random number mod p. Now generate A,